Designing a Procedure for the Acquisition of Probability Constraints for Bayesian Networks
نویسندگان
چکیده
Among the various tasks involved in building a Bayesian network for a real-life application, the task of eliciting all probabilities required is generally considered the most daunting. We propose to simplify this task by first acquiring qualitative features of the probability distribution to be represented; these features can subsequently be taken as constraints on the precise probabilities to be obtained. We discuss the design of a procedure that guides the knowledge engineer in acquiring these qualitative features in an efficient way, based on an in-depth analysis of all viable combinations of features. In addition, we report on initial experiences with our procedure in the domain of neonatology.
منابع مشابه
Determination of Maximum Bayesian Entropy Probability Distribution
In this paper, we consider the determination methods of maximum entropy multivariate distributions with given prior under the constraints, that the marginal distributions or the marginals and covariance matrix are prescribed. Next, some numerical solutions are considered for the cases of unavailable closed form of solutions. Finally, these methods are illustrated via some numerical examples.
متن کاملA Novel Method for Designing and Optimization of Networks
In this paper, system planning network is formulated with mixed-integer programming. Two meta-heuristic procedures are considered for this problem. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematica...
متن کاملA Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملDefining Classes of Influences for the Acquisition of Probability Constraints for Bayesian Networks
The task of eliciting all probabilities required for a Bayesian network can be supported by first acquiring qualitative constraints on the numerical quantities to be obtained. Building upon the concept of qualitative influence, we analyse such constraints and define a small number of influence classes. Based upon these classes, we present a method for efficiently acquiring the qualitative const...
متن کاملLPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring
Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...
متن کامل